Provable Unlinkability against Traffic Analysis
نویسندگان
چکیده
Chaum [1, 2] suggested a simple and efficient protocol aimed at providing anonymity in the presence of an adversary watching all communication links. Chaum’s protocol is known to be insecure. We show that Chaum’s protocol becomes secure when the attack model is relaxed and the adversary can control at most 99% of communication
منابع مشابه
Provable Unlinkability Against Traffic Analysis Already After O(log(n)) Steps!
We consider unlinkability of communication problem: given n users, each sending a message to some destination, encode and route the messages so that an adversary analyzing the traffic in the communication network cannot link the senders with the recipients. A solution should have a small communication overhead, that is, the number of additional messages should be kept low. David Chaum introduce...
متن کاملUnlinkability Measure for IEEE 802.11b MANET
In this paper, we propose a two-step unlinkability measuring approach for MANET, i.e., (a) evidence collection using statistical packet-counting traffic analysis, (b) evidence theory-based unlinkability measure. We use IEEE 802.11b-based MANETs as our analytical systems. Using our approach, we can collect a set of evidence to set up a probability assignment for each possible communication relat...
متن کاملTEL-AVIV UNIVERSITY RAYMOND AND BEVERLY SACKLER FACULTY OF EXACT SCIENCES SCHOOL OF COMPUTER SCIENCE Hide and Seek: Provable Anonymity in Computer Networks
Anonymous communication methods have been under heavy research in the last years. Specifically, with the advent of peer to peer networks, anonymity is grasped as a desired property of any well designed system for exchanging information between parties. Previous work dealing with anonymity and privacy is mostly application driven and intuitively based, paying more attention to implementation det...
متن کاملSecurity Analysis and Fix of an Anonymous Credential System
Anonymous credentials are an important privacy-enhancing technique that allows users to convince a service provider of their legitimacy for service accesses in an anonymous manner. Among others, a fundamental feature of anonymous credentials is unlinkability, that is, multiple showings of the same credential should not be linked by the service providers, the issuing organization, or the coaliti...
متن کاملA Model of Onion Routing with Provable Anonymity
Onion routing is a scheme for anonymous communication that is designed for practical use. It has not been modeled formally, however, and therefore its anonymity guarantees have not been rigorously analyzed. We give an IO-automata model of an onion-routing protocol and, under possibilistic definitions, characterize the situations in which anonymity and unlinkability are guaranteed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004